Sample-Based Tree Search with Fixed and Adaptive State Abstractions
نویسندگان
چکیده
منابع مشابه
Sample-Based Tree Search with Fixed and Adaptive State Abstractions
Sample-based tree search (SBTS) is an approach to solving Markov decision problems based on constructing a lookahead search tree using random samples from a generative model of the MDP. It encompasses Monte Carlo tree search (MCTS) algorithms like UCT as well as algorithms such as sparse sampling. SBTS is well-suited to solving MDPs with large state spaces due to the relative insensitivity of S...
متن کاملAdaptive Tree Search
Advisor: Stuart M. Shieber Adaptive Tree Search Wheeler Ruml Combinatorial optimization and constraint satisfaction problems are ubiquitous in computer science, arising in areas as diverse as resource allocation, automated design, planning, and logical inference. Finding optimal solutions to such problems often entails searching an intractably large tree of possibilities. Problems beyond the re...
متن کاملEfficient Bayes-Adaptive Reinforcement Learning using Sample-Based Search
Bayesian model-based reinforcement learning is a formally elegant approach to learning optimal behaviour under model uncertainty, trading off exploration and exploitation in an ideal way. Unfortunately, finding the resulting Bayes-optimal policies is notoriously taxing, since the search space becomes enormous. In this paper we introduce a tractable, sample-based method for approximate Bayesopti...
متن کاملSample-based Search Methods for Bayes-adaptive Planning
A fundamental issue for control is acting in the face of uncertainty about the environment. Amongst other things, this induces a trade-off between exploration and exploitation. A model-based Bayesian agent optimizes its return by maintaining a posterior distribution over possible environments, and considering all possible future paths. This optimization is equivalent to solving a Markov Decisio...
متن کاملFinite-state abstractions for probabilistic computation tree logic
Probabilistic Computation Tree Logic (PCTL) is the established temporal logic for probabilistic verification of discrete-time Markov chains. Probabilistic model checking is a technique that verifies or refutes whether a property specified in this logic holds in a Markov chain. But Markov chains are often infinite or too large for this technique to apply. A standard solution to this problem is t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2017
ISSN: 1076-9757
DOI: 10.1613/jair.5483